Robust Ordinal Embedding from Contaminated Relative Comparisons
نویسندگان
چکیده
منابع مشابه
Ethically robust comparisons of bidimensional distributions with an ordinal attribute
We provide foundations for robust normative evaluation of distributions of two attributes, one of which is cardinally measurable and transferable between individuals and the other is ordinal and non-transferable. The result that we establish takes the form of an analogue to the standard Hardy, Littlewood, and Pólya (1934) theorem for distributions of one cardinal attribute. More specifically, w...
متن کاملLocal Ordinal Embedding
We study the problem of ordinal embedding: given a set of ordinal constraints of the form distance(i, j) < distance(k, l) for some quadruples (i, j, k, l) of indices, the goal is to construct a point configuration x̂1, ..., x̂n in R that preserves these constraints as well as possible. Our first contribution is to suggest a simple new algorithm for this problem, Soft Ordinal Embedding. The key fe...
متن کاملUniqueness of Ordinal Embedding
Ordinal embedding refers to the following problem: all we know about an unknown set of points x1, . . . , xn ∈ R are ordinal constraints of the form ‖xi−xj‖ < ‖xk−xl‖; the task is to construct a realization y1, . . . , yn ∈ R that preserves these ordinal constraints. It has been conjectured since the 1960ies that upon knowledge of all ordinal constraints a large but finite set of points can be ...
متن کاملLearning a Distance Metric from Relative Comparisons
This paper presents a method for learning a distance metric from relative comparison such as “A is closer to B than A is to C”. Taking a Support Vector Machine (SVM) approach, we develop an algorithm that provides a flexible way of describing qualitative training data as a set of constraints. We show that such constraints lead to a convex quadratic programming problem that can be solved by adap...
متن کاملActive Metric Learning from Relative Comparisons
This work focuses on active learning of distance metrics from relative comparison information. A relative comparison specifies, for a data point triplet (xi, xj , xk), that instance xi is more similar to xj than to xk. Such constraints, when available, have been shown to be useful toward defining appropriate distance metrics. In real-world applications, acquiring constraints often require consi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Proceedings of the AAAI Conference on Artificial Intelligence
سال: 2019
ISSN: 2374-3468,2159-5399
DOI: 10.1609/aaai.v33i01.33017908